Bounds for the Zeros of a Polynomial with Restricted Coefficients
نویسندگان
چکیده
منابع مشابه
Bounds for the Zeros of a Complex Polynomial with Restricted Coefficients
If P(z) be a polynomial of degree n with decreasing coefficients, then all its zeros lie in |z| ≤ 1. In this paper we find new classical results concerning Enestrom-Kakeya theorem and related analytic functions. Besides several consequences, our results improve the bounds by relaxing and weakening the hypothesis in some cases.
متن کاملInequalities for the polar derivative of a polynomial with $S$-fold zeros at the origin
Let $p(z)$ be a polynomial of degree $n$ and for a complex number $alpha$, let $D_{alpha}p(z)=np(z)+(alpha-z)p'(z)$ denote the polar derivative of the polynomial p(z) with respect to $alpha$. Dewan et al proved that if $p(z)$ has all its zeros in $|z| leq k, (kleq 1),$ with $s$-fold zeros at the origin then for every $alphainmathbb{C}$ with $|alpha|geq k$, begin{align*} max_{|z|=...
متن کاملThe Real Zeros of a Random Polynomial with Dependent Coefficients
Abstract. Mark Kac gave one of the first results analyzing random polynomial zeros. He considered the case of independent standard normal coefficients and was able to show that the expected number of real zeros for a degree n polynomial is on the order of 2 π logn, as n → ∞. Several years later, Sambandham considered two cases with some dependence assumed among the coefficients. The first case ...
متن کاملBounds for Linear Recurrences with Restricted Coefficients
This paper derives inequalities for general linear recurrences. Optimal bounds for solutions to the recurrence are obtained when the coefficients of the recursion lie in intervals that include zero. An important aspect of the derived bounds is that they are easily computable. The results bound solutions of triangular matrix equations and coefficients of ratios of power series.
متن کاملA posteriori Error Bounds for the Zeros of a Polynomial
An algorithm for the computation of error bounds for the zeros of a polynomial is described. This algorithm is derived by applying Rouch6's theorem to a Newton-like interpolation formula for the polynomial, and so it is suitable in the case where the approximations to the zeros of the polynomial are computed successively using deflation. Confluent and clustered approximations are handled easily...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics
سال: 2012
ISSN: 2152-7385,2152-7393
DOI: 10.4236/am.2012.31005